deterministic finite state automaton meaning in Chinese

决定型有限状态机

Deterministic finite state automaton
决定型有限状态机
Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ) , a dfa has been designed , which can identify multiple kind numbers
摘要基于有限自动机的多模式匹配算法（ dfsa算法），设计出同时识别多种数的有限自动机。
( 2 ) based on dfsa algorithm ( deterministic finite state automaton ) and combined with quick search algorithm , this paper analyses and implements a new multi - pattern string match algorithm that consumes less half of memory space of standard dfsa algorithm
该算法是以确定性有限状态自动机( dfsa )为基础，结合quicksearch算法而提出的，可以用来提高主题爬行器的网页分析和web网页分类器的速度。